Towards an Exclusion Mutual Tolerant Algorithm to Failures
نویسندگان
چکیده
The distributed algorithmic is widely used in various economic and industrial fields as finance, medical, industry, telecommunication. New technologies are increasing rapidly. From now on, applications must associate two conditions: auto-execution on heterogeneous grid computers, on the one hand and on the other hand, satisfaction of the temporal and safety constraints. Hence this paper deals with performing an algorithm based on an innovative idea based on the mutual exclusion which permits to adjust the access conflict to the shared resources and to synchronize sites in a distributed system. The performed algorithm was tolerant to breakdowns. A site wanting to enter in critical section demands the permission of all sites of it set called quorum. This quorum notion assures the mutual exclusion even in the case of breakdowns. The presented algorithm was exempt of deadlock and assures the equity.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Fault-tolerant Mutual Exclusion Algorithm in Asynchronous Distributed Systems
Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...
متن کاملA O(log2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure
A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree structure, is presented. The rooted tree introduced. named “open-cube“ , has noteworthy stability and locality properties, allowing the proposed algorithm to achieve good perfotmances and high tolerance to node failures: the worst case message complexity per request is, in the absence of node fail...
متن کاملA Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems
In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the ...
متن کاملA Fault-Tolerant Triple Triangular Mesh Protocol for Distributed Mutual Exclusion1
In the paper, we propose a triple triangular mesh protocol for mutual exclusion, in which the nodes in the system are organized into a triangular mesh. The quorum size is k that is O p N , where N is the number of nodes in the system and is equal to k k 1 2 . The protocol is fault-tolerant up to k 2 site failures and communication failures in the worst case, even when such failures lead to netw...
متن کامل